Dynamic threshold control of RED for establishing fairness among thousands of TCP connections
نویسندگان
چکیده
RED (Random Early Detection) routers can provide better fairness among many competing TCP connections than TD (Tail-Drop) routers, but it is true only when the control parameters of RED are set appropriately according to the network congestion status. However, it is very difficult because the network condition varies largely, especially when the number of accommodated connections is large. In this paper, therefore, we propose dt-RED (RED with dynamic threshold control), which dynamically regulates the RED parameters according to the observed behavior of the RED queue. We confirm the effectiveness of the proposed algorithm through some simulation experiments, and the results show that it can provide better fairness than the original RED, and TD routers, without careful setting of the parameters.
منابع مشابه
The dynamic threthold control algorithm of RED for thousands of TCP flows
In this paper, we first investigate the performance of RED and the traditional TD (Tail-Drop) routers when there are more than 1000 TCP connections in the network, especially in term of fairness among connections. The result is that RED can achieve better fairness than TD when its control parameters are appropriately tuned according to the network condition. However, when the parameters are not...
متن کاملAnalysis of dynamic behaviors of many TCP connections sharing tail-drop/RED routers
Appropriate control parameters are important for the successful deployment of RED (Random Early Detection) routers, especially when many TCP connections share the bottleneck link. In this paper, we first describe a new simple analysis method for determining the window size distribution of many TCP connections sharing a bottleneck router. We consider two kinds of buffering disciplines: TD (Tail ...
متن کاملDesigning AQM Mechanism for Improving Fairness among TCP Connections in Tandem Networks
In recent years, AQM (Active Queue Management) mechanisms, which control the number of packets in the router’s buffer by randomly discarding an arriving packet, have been actively studied. In past studies, most of AQM mechanisms have been designed by taking account of a single router; i.e., few AQM mechanisms have been designed by taking account of multiple routers in the network. In a tandem n...
متن کاملA Study on High Speed Packet Scheduling Method for Achieving Fairness among TCP Connections
In this paper, we first investigate the fairness between TCP Reno and TCP Vegas by focusing on the situation where Reno and Vegas connections share the bottleneck link. From the analysis and the simulation results, we find that the performance of TCP Vegas is much smaller than that of TCP Reno as opposed to an expectation on TCP Vegas. The RED algorithm improves the fairness to some degree, but...
متن کاملMore Results on ZL-RED for fairness enhancement between TCP Reno and Vegas
In this paper, we propose ZL-RED (Zombie Listed RED) algorithm, which ehhances SRED algorithm to provide better fairness among many flows at the router buffer. ZL-RED uses the Zombie List, which is also used by SRED, to detect mis-behaving flows which send packets to the router at higher rate than the other flows, and sets larger packet discarding probability to those flows. We evaluate the eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002